Monomial Representations for Grr Obner Bases Computations
نویسنده
چکیده
Monomial representations and operations for Grr obner bases computations are investigated from an implementation point of view. The technique of vectorized monomial operations is introduced and it is shown how it expedites computations of Grr obner bases. Furthermore, a rank-based monomial representation and comparison technique is examined and it is concluded that this technique does not yield an additional speedup over vectorized comparisons. Extensive benchmark tests with the Computer Algebra System Singular are used to evaluate these concepts.
منابع مشابه
Computing Grr Obner Fans of Toric Ideals
The monomial initial ideals of a graded polynomial ideal are in bijection with the vertices of a convex polytope known as the state polytope of the ideal. The Grr obner fan of the ideal is the normal fan of its state polytope. In this paper we present a software system called TiGERS (Toric Grr obner bases Enumeration by Reverse Search) for computing the Grr obner fan of a toric ideal by enumera...
متن کامل1 HOW TO USE GR OBNER - MATHEMATICA 2 Global Variable Semantics Possible Values
In this paper we report on GR OBNER-Mathematica, an experimental implementation for computing Grr obner bases in Mathematica. This implementation in its current form ooers three diierent versions of the Grr obner bases algorithm and is generic with respect to the ordering of power products, the domain of coeecients of the polynomials, and the representation of power products, monomials, polynom...
متن کاملOn Some Basic Applications of Grr Obner Bases in Non-commutative Polynomial Rings
In this paper we generalize some basic applications of Grr obner bases in commutative polynomial rings to the non-commutative case. We deene a non-commutative elimination order. Methods of nding the intersection of two ideals are given. If both the ideals are monomial we deduce a nitely written basis for their intersection. We nd the kernel of a homomorphism, and decide membership of the image....
متن کاملGrr Obner Bases for Polynomial Ideals over Commutative Noetherian Rings and Related Results ?
We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...
متن کاملNoncommutative Grr Obner Bases. a Computational and Theoretical Tool
Overview These notes consists of ve lectures. Each lecture covers the material that I will present with fuller details and exercises. I have also included some material in appendices which the reader might nd interesting but which I will not have time to cover in my lectures. Lecture 1 introduces both linear Grr obner bases and Grr obner bases for algebras. Lecture 2 surveys some of the basis a...
متن کامل